Combining free choice and time in Petri nets
نویسندگان
چکیده
منابع مشابه
Synthesis of Bounded Choice-Free Petri Nets
This paper describes a synthesis algorithm tailored to the construction of choice-free Petri nets from finite persistent transition systems. With this goal in mind, a minimised set of simplified systems of linear inequalities is distilled from a general region-theoretic approach, leading to algorithmic improvements as well as to a partial characterisation of the class of persistent transition s...
متن کاملFree-choice Petri Nets an Algebraic Approach
In this paper, we give evolution equations for free choice Petri net which generalize the max; +]-algebraic setting already known for event graphs. These evolution equations can be seen as a coupling of two linear systems, a (min; +)-linear system, and a quasi (+;)-linear one. This leads to new methods and algorithms to: In the untimed case: check liveness and several other basic logical proper...
متن کاملLiveness in Free-Choice Petri Nets An Algebraic Approach
In this paper, we show that the evolution equations for timed free choice Petri net can be used to prove logical properties of the underlying un-timed net. For example, this approach leads to new methods and algorithms to check liveness and several other basic properties, such as absence or presence of deadlocks. The main tools for proving these properties are graph theory and idempotent algebr...
متن کاملOn State Estimation of Timed Choice-Free Petri Nets
In this paper, we present an online algorithm for state estimation of timed choicefree Petri nets. We assume that the net structure and initial marking are known, and that the set of transitions is divided in observable and unobservable one. Given an observed word and assuming that the time durations associated to the unobservable transitions are unknown, our problem is to estimate the possible...
متن کاملStructure Theory of Petri Nets: the Free Choice Hiatus
Structure theory asks whether a relationship can be found between the behaviour of a marked net and the structure of the underlying unmarked net. From the rich body of structure theoretical results that exists in Petri net theory, this paper selects a few examples which are deemed to be typical. The class of free choice nets, whose structure theory is particularly agreeable, is studied in some ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming
سال: 2020
ISSN: 2352-2208
DOI: 10.1016/j.jlamp.2018.11.006